Non - transformational termination analysis ofLogic Programs , based on generalterm - orderings ?
نویسندگان
چکیده
منابع مشابه
Non-transformational Termination Analysis of Logic Programs, Based on General Term-ordering Non-transformational Termination Analysis of Logic Programs, Based on General Term-ordering
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in trans-formational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. W...
متن کاملNon-tranformational termination analysis of logic programs, based on general term-orderings
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transform-ational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. W...
متن کاملTermination Analysis of Logic Programs Using Acceptability with General Term Orders Termination Analysis of Logic Programs Using Acceptability with General Term Orders
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in trans-formational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. W...
متن کاملTermination analysis of logic programs using acceptability with general term orders
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the termrewrite system obtained through some transformation. We ...
متن کاملAcceptability with General Orderings
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000